Improved Lower Bounds for the 2-Page Crossing Numbers of $K_{m,n}$ and $K_n$ via Semidefinite Programming
نویسندگان
چکیده
منابع مشابه
Improved Lower Bounds for the 2-Page Crossing Numbers of Km, n and Kn via Semidefinite Programming
It has been long conjectured that the crossing numbers of the complete bipartite graph Km,n and of the complete graph Kn equal Z(m,n) := ⌊
متن کاملImproved Lower Bounds on Book Crossing Numbers of Complete Graphs
A book with k pages consists of a straight line (the spine) and k half-planes (the pages), such that the boundary of each page is the spine. If a graph is drawn on a book with k pages in such a way that the vertices lie on the spine, and each edge is contained in a page, the result is a k-page book drawing (or simply a k-page drawing). The k-page crossing number νk(G) of a graph G is the minimu...
متن کاملAn Improved Lower Bound for Crossing Numbers
The crossing number of a graph G = (V,E), denoted by cr(G), is the smallest number of edge crossings in any drawing of G in the plane. Leighton [14] proved that for any n-vertex graph G of bounded degree, its crossing number satisfies cr(G) + n = Ω(bw(G)), where bw(G) is the bisection width of G. The lower bound method was extended for graphs of arbitrary vertex degrees to cr(G)+ 1 16 ∑ v∈G d 2...
متن کاملOptimal bounds for correlations via semidefinite programming
Nonlocal boxes (NLBs) are devices that are used to generate correlated bits between two spatially separated parties. If the generated correlation is weak, it can sometimes be distilled into a stronger correlation by repeated applications of the nonlocal box. We initiate here a study of the distillation of correlations for nonlocal boxes that output quantum states rather than classical bits. We ...
متن کاملHigh-Accuracy Semidefinite Programming Bounds for Kissing Numbers
The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit spheres which simultaneously can touch a central unit sphere. Bachoc and Vallentin developed a method to find upper bounds for the kissing number based on semidefinite programming. This paper is a report on high accuracy calculations of these upper bounds for n ≤ 24. The bound for n = 16 implies a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2012
ISSN: 1052-6234,1095-7189
DOI: 10.1137/110852206